A simpler and faster algorithm for optimal total-work-content-power due date determination

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Faster and Simpler Algorithm for Optimal Strategies of Blotto Game

In the Colonel Blotto game, which was initially introduced by Borel in 1921, two colonels simultaneously distribute their troops across different battlefields. The winner of each battlefield is determined independently by a winner-take-all rule. The ultimate payoff of each colonel is the number of battlefields he wins. The Colonel Blotto game is commonly used for analyzing a wide range of appli...

متن کامل

A Faster and Simpler 2-Approximation Algorithm for Block Sorting

Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is NP-hard and all of the previously known heuristics lack proof of any approximation ratio. We present here an approximation algorithm for the block sorting problem with approximation ratio of 2 and run time O(n). The app...

متن کامل

A New Much Faster and Simpler Algorithm for Lapack Dgels

We present new algorithms for computing the linear least squares solution to overde-termined linear systems and the minimum norm solution to underdetermined linear systems. For both problems, we consider the standard formulation min kAX ? BkF and the transposed formulation min kA T X ? BkF , i.e, four diierent problems in all. The functionality of our implementation corresponds to that of the L...

متن کامل

A faster algorithm for a due date assignment problem with tardy jobs

Keywords: Single-machine sequencing Weighted number of tardy jobs Due date assignment a b s t r a c t The single-machine due date assignment problem with the weighted number of tardy jobs objective, (the TWNTD problem), and its generalization with resource allocation decisions and controllable job processing times have been solved in O(n 4) time by formulating and solving a series of assignment...

متن کامل

a benchmarking approach to optimal asset allocation for insurers and pension funds

uncertainty in the financial market will be driven by underlying brownian motions, while the assets are assumed to be general stochastic processes adapted to the filtration of the brownian motions. the goal of this study is to calculate the accumulated wealth in order to optimize the expected terminal value using a suitable utility function. this thesis introduced the lim-wong’s benchmark fun...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical and Computer Modelling

سال: 1990

ISSN: 0895-7177

DOI: 10.1016/0895-7177(90)90373-u